Dynamic and Kinetic Delaunay Triangulation in 2D and 3D: A Survey
نویسنده
چکیده
Delaunay Triangulation (DT) is one of the most fundamental data structures in computational geometry. It is well known in geosciences for many years to model the real world objects. To extend its applications for simulating the real world processes, however, this data structure must support dynamic point sets (where the points are added or deleted) and kinetic point sets (where the position of the points vary over time). This paper reviews the algorithms introduced in the literature to construct the Delaunay triangulation of 2D and 3D dynamic and kinetic points.
منابع مشابه
Apply ing Two-d imens iona l De launay Triangulat ion to Stereo Data Interpolat ion
A b s t r a c t . Interpolation of 3D segments obtained through a trinocular stereo process is achieved by using a 2D Delannay triangulation on the image plane of one of the vision system cameras. The resulting two-dimensional triangulation is backprojected into the 3D space, generating a surface description in terms of triangular faces. The use of a constrained Delaunay triangulation in the im...
متن کاملCAD Tools for Creating Space-filing 3D Escher Tiles
We discuss the design and implementation of CAD tools for creating decorative solids that tile 3-space in a regular, isohedral manner. Starting with the simplest case of extruded 2D tilings, we describe geometric algorithms used for maintaining boundary representations of 3D tiles, including a Java implementation of an interactive constrained Delaunay triangulation library and a mesh-cutting al...
متن کاملEfficient Proximity Search for -D Cuboids
In this paper, we give the definition for the voronoi diagram and its dual graph – Delaunay triangulation for 3D cuboids. We prove properties of the 3D Delaunay triangulation, and provide algorithms to construct and update the Delaunay triangulation. The Delaunay triangulation data structure is used to perform proximity searches for both static and kinetic cases. We describe experimental result...
متن کاملMaintaining a Minimum Spanning Tree for Kinetic Autonomous Robots in 2D-Euclidean Plane
This paper presents a procedure for maintaining a 2D-Euclidean Minimum Spanning Tree for a set of n autonomous kinetic robots having no central supervision. The proposed procedure is based on the Kinetic data structure framework and the well known fact that the edges of the minimum spanning tree for a given set of points in the 2D-Euclidean domain are contained in the edges of its Delaunay tria...
متن کاملDelaunay Refinement Algorithms for Estimating Local Feature Size in 2D and 3D
We present Delaunay refinement algorithms for estimating local feature on the input vertices of a 2D piecewise linear complex and on the input vertices and segments of a 3D piecewise linear complex. These algorithms are designed to eliminate the need for a local feature size oracle during quality mesh generation of domains containing acute input angles. In keeping with Ruppert’s algorithm, encr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010